NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
531	Universidad de Buenos Aires Facultad de Ciencias Exactas y Naturales ´n Departamento de Computacio A study of the Combination Problem: Add to Reading List Source URL: dc.uba.ar Language: English - Date: 2014-11-21 09:25:33 Logic in computer science Electronic design automation Formal methods NP-complete problems Model theory Satisfiability Modulo Theories Satisfiability Boolean satisfiability problem Decision problem Theoretical computer science Mathematics Mathematical logic
532	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
533	Sudoku and Shidoku Tanya Khovanova October 15, 2012 Teacher: “How much do we get if we cut eight into two halves? Student: “Two threes, if we cut vertically; and two zeros, if we cut horizontally. Add to Reading List Source URL: www.tanyakhovanova.com Language: English - Date: 2012-11-06 18:08:56 NP-complete problems Sudoku Subtraction Pi 3 Mathematics of Sudoku Mathematics Logic puzzles Recreational mathematics
534	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
535	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Planar graphs Hamiltonian path Polyhedron Dodecahedron Graph theory Theoretical computer science Mathematics
536	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:20 Planar graphs Graph Unit disk graph Planar straight-line graph P Geographic routing Graph theory Theoretical computer science NP-complete problems
537	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Hamilton Circuits in Hexagonal Grid Graphs Kamrul Islam(1) (1) Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:51 Hamiltonian path Graph coloring Graph Path decomposition Edge coloring Graph theory Planar graphs NP-complete problems
538 $Old Testament / Hebrew Bible / Abiathar / David / Crossword / Barbara Ward / Michmash / Solomon / Sword of the Spirit / NP-complete problems / Kings of ancient Judah / Nevi\'im$	PHOTO: V. SLADON 175 YEARS – 50 GREAT CATHOLICS / Michael Walsh on Barbara Ward A friend, a retired senior lecturer on international Add to Reading List Source URL: www.thetablet.co.uk Language: English Old Testament Hebrew Bible Abiathar David Crossword Barbara Ward Michmash Solomon Sword of the Spirit NP-complete problems Kings of ancient Judah Nevi\'im
539	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
540	AVACS – Automatic Verification and Analysis of Complex Systems REPORTS of SFB/TR 14 AVACS Editors: Board of SFB/TR 14 AVACS Add to Reading List Source URL: www.avacs.org Language: English - Date: 2013-02-12 08:10:24 Applied mathematics Logic in computer science Constraint programming Electronic design automation NP-complete problems Interpolation Craig interpolation Satisfiability Modulo Theories Mathematical proof Theoretical computer science Mathematics Mathematical logic

UPDATE